A simple upper bound on the redundancy of Huffman codes
نویسندگان
چکیده
Upper bounds on the redundancy of Huffman codes have been extensively studied in the literature. Almost all of these bounds are in terms of the probability of either the most likely or the least likely source symbol. In this correspondence, we prove a simple upper bound in terms of the probability of any source symbol.
منابع مشابه
The Rényi redundancy of generalized Huffman codes
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...
متن کاملTight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions are introduced which play a fundamental role in AUH codes. It is shown that such distributions maximize the average length and the entropy of the code for a ...
متن کاملOn the Redundancy of Optimum Fixed-to-Variable Length Codes
There has been much interest in recent years in bounds on the redundancy of Huffman codes, given only partial information about the source word distribution, such as the probability of the most likely source. This work determines upper and lower bounds for the redundancy of Huffman codes of source words which are binomially distributed. Since the complete distribution is known, it is possible t...
متن کاملOn the Redundancy Achieved by Huffman Codes
It has been recently proved that the redundancy r of any discrete memoryless source satisses r 1?H(p N), where p N is the least likely source letter probability. We prove that this bound is achieved only by sources consisting of two letters and that a sharper bound holds if the number of source letters is greater than two. Also provided is a new upper bound on r, as function of the two least li...
متن کاملUniversity of Warsaw Faculty of Mathematics , Informatics and Mechanics Marek Biskup
In compressed data a single bit error propagates because of the corruption of the decoder’s state. This work is a study of error resilience in compressed data and, in particular, of the recovery of as much data as possible after a bit error. It is focused on Huffman codes. In a message encoded with a Huffman code a bit error causes the decoder to lose synchronization with the coder. The error p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 48 شماره
صفحات -
تاریخ انتشار 2002